Aggregation World University Ranking Based on HITS
نویسندگان
چکیده
منابع مشابه
Ranking Aggregation Based on Belief Function Theory
The ranking aggregation problem is that to establishing a new aggregate ranking given a set of rankings of a finite set of items. This problem is met in various applications, such as the combination of user preferences, the combination of lists of documents retrieved by search engines and the combination of ranked gene lists. In the literature, the ranking aggregation problem has been solved as...
متن کاملScenario 2, lower ranking HaMStR hits
For 168 core-orthologs more than 1 human protein was assigned as a putative ortholog. For 134 of them InParanoid groups the human proteins as co-orthologs with respect to opossum (23), any other vertebrate (5), C. intestinalis (88), or invertebrate species (18). (This implies that the corresponding genes duplicated only considerably recent in evolution). In 8 further cases no InParanoid ortholo...
متن کاملAsian top universities in six world university ranking systems
There are a variety of ranking systems for universities throughout the different continents of the world. The majority of the world ranking systems have paid special attention toward evaluation of universities and higher education institutions at the national and international level. This paper tries to study the similarities and status of top Asian universities in the list of top 200 universit...
متن کاملthe effect of lexically based language teaching (lblt) on vocabulary learning among iranian pre-university students
هدف پژوهش حاضر بررسی تاثیر روش تدریس واژگانی (واژه-محور) بر یادگیری لغات در بین دانش آموزان دوره پیش دانشگاهی است. بدین منظور دو گروه از دانش آموزان دوره پیش دانشگاهی (شصت نفر) که در سال تحصیلی 1389 در شهرستان نور آباد استان لرستان مشغول به تحصیل بودند انتخاب شده و به صورت قراردادی گروه آزمایش و گواه در نظر گرفته شدند. در ابتدا به منظور اطمینان یافتن از میزان همگن بودن دو گروه از دانش واژگان، آ...
15 صفحه اولUsing Bloom Filters to Speed Up HITS-Like Ranking Algorithms
This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of its immediate neighborhood (which is a query-independent operation and thus can be done off-line), and to approximate the neighborhood graph of a result set at query-time by combining the summaries of the result set nodes. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Materials Science and Engineering
سال: 2017
ISSN: 2572-889X
DOI: 10.12783/dtmse/amsee2017/14313